Lower Bound Functions for Polynomials
نویسندگان
چکیده
منابع مشابه
Rigorous Affine Lower Bound Functions for Multivariate Polynomials and Their Use in Global Optimisation
This paper addresses the problem of finding tight affine lower bound functions for multivariate polynomials, which may be employed when global optimisation problems involving polynomials are solved with a branch and bound method. These bound functions are constructed by using the expansion of the given polynomial into Bernstein polynomials. The coefficients of this expansion over a given box yi...
متن کاملBuckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملBernstein's polynomials for convex functions and related results
In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of Hermite-Hadamard inequality for convex functions.
متن کاملNumerical solution of delay differential equations via operational matrices of hybrid of block-pulse functions and Bernstein polynomials
In this paper, we introduce hybrid of block-pulse functions and Bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. Then, we utilize them to solve delay differential equations and time-delay system. The method is based upon e...
متن کاملNonclassical Polynomials as a Barrier to Polynomial Lower Bounds
The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness, constructions of Ramsey graphs and locally decodable codes. Still, most of the known lower bounds become trivial for polynomials of superlogarithmic degree. Here, we s...
متن کامل